________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:05:20
Input Data from:  dataset148.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1605
Average f[i]   :4450
Average g[i,j] :2049,01960784314
Total demand   :5340
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 18
> Selected Move:	1210	1	-1	9	4500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1210


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 81
> Selected Move:	1650	1	-1	3	11000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1650


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 97
> Selected Move:	2210	1	-1	13	16000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0    >new incumb.: 2210


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 108
> Selected Move:	2740	1	-1	12	22500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0    >new incumb.: 2740


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 110
> Selected Move:	2830	3	9	19	22500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1    >new incumb.: 2830


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 108
> Selected Move:	2830	3	1	17	24000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  1  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 79
> Selected Move:	2830	4	17	3	23500


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 91
> Selected Move:	2830	4	3	12	23800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  3  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 89
> Selected Move:	2830	3	13	14	23300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  3  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 95
> Selected Move:	2830	4	12	3	23000


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 96
> Selected Move:	2830	4	3	14	24900


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  0  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 76
> Selected Move:	2830	4	14	17	23500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 90
> Selected Move:	2830	4	17	19	24800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 89
> Selected Move:	2800	3	17	10	24800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 76
> Selected Move:	2800	4	19	3	23000


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 97
> Selected Move:	2800	4	3	10	24400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  3  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 76
> Selected Move:	2830	3	10	1	22000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 109
> Selected Move:	2800	3	1	18	24500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 76
> Selected Move:	2800	4	18	3	22000


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 102
> Selected Move:	2800	4	3	12	22300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  3  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 101
> Selected Move:	2800	4	12	14	23900


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 82
> Selected Move:	2800	4	14	19	23800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 95
> Selected Move:	2800	3	14	13	24300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 81
> Selected Move:	2800	4	19	3	22500


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 101
> Selected Move:	2800	4	3	12	22800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  3  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 97
> Selected Move:	2800	4	12	13	24200


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  3  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 80
> Selected Move:	2800	4	13	18	25000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 89
> Selected Move:	2800	3	18	10	24900


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  3  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 74
> Selected Move:	2800	4	10	3	23500


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 88
> Selected Move:	2800	4	3	12	23800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  3  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 87
> Selected Move:	2800	3	13	14	23300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 91
> Selected Move:	2800	4	12	14	24900


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  1  0  3  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 95
> Selected Move:	2750	3	12	8	24400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  1  0  1  0  0  0  3  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 80
> Selected Move:	2780	3	10	17	24400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  1  0  0  0  0  0  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 77
> Selected Move:	2810	3	14	6	24500


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 79
> Selected Move:	2840	3	3	5	23000


> New Y[]: 
	
	 2  0  4  0  0  1  3  0  1  0  0  0  0  0  0  0  0  1  0  1    >new incumb.: 2840


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 103
> Selected Move:	2840	4	6	5	24500


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 79
> Selected Move:	2840	4	5	8	22800


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  3  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 103
> Selected Move:	2840	4	8	17	23000


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 101
> Selected Move:	2840	4	17	19	24300


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  0  0  0  0  0  0  1  0  3 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 97
> Selected Move:	2790	3	5	4	24300


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  1  0  0  0  0  0  0  0  0  1  0  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 83
> Selected Move:	2790	4	19	4	23500


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 95
> Selected Move:	2810	3	4	3	24000


> New Y[]: 
	
	 2  0  4  3  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 89
> Selected Move:	2810	4	3	8	24300


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  3  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 85
> Selected Move:	2810	4	8	17	24500


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  1  0  0  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 88
> Selected Move:	2810	3	8	12	25000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  0  0  1  0  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 78
> Selected Move:	2810	4	17	3	24500


> New Y[]: 
	
	 2  0  4  3  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 83
> Selected Move:	2810	4	3	6	25000


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 79
> Selected Move:	2810	4	6	12	24800


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  0  0  3  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 91
> Selected Move:	2740	3	19	9	24800


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  1  0  0  3  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 87
> Selected Move:	2740	4	12	3	24500


> New Y[]: 
	
	 2  0  4  3  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 91
> Selected Move:	2740	4	3	6	25000


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 84
> Selected Move:	2740	4	6	17	25000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  1  0  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 97
> Selected Move:	2740	3	6	13	24000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  0  0  1  1  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 94
> Selected Move:	2740	4	17	3	23500


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 97
> Selected Move:	2740	4	3	12	23800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  0  0  3  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 95
> Selected Move:	2740	3	13	14	23300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  0  0  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 98
> Selected Move:	2747	3	2	16	25300


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  0  0  3  0  1  0  4  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 79
> Selected Move:	2820	4	12	3	25000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  0  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 81
> Selected Move:	2820	4	3	16	24300


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  1  0  0  1  0  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 86
> Selected Move:	2820	4	3	12	24900


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  0  0  4  0  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 82
> Selected Move:	2800	3	17	10	24900


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  1  0  4  0  1  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 84
> Selected Move:	2800	4	12	3	24300


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  1  1  0  1  0  1  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 89
> Selected Move:	2800	4	3	16	25000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  1  0  1  0  1  0  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 83
> Selected Move:	2800	3	10	18	24000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  0  1  0  1  0  4  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 92
> Selected Move:	2800	4	3	12	24300


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  0  0  3  0  1  0  4  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 89
> Selected Move:	2800	4	12	16	23900


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  0  0  4  0  1  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 92
> Selected Move:	2800	4	12	3	23300


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  1  0  0  1  0  1  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 95
> Selected Move:	2800	4	16	12	23900


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  1  0  0  3  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 69 #######################


> Neighbours evaluated; 96
> Selected Move:	2820	3	18	17	24900


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  1  0  0  3  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,18

## ITERATION 70 #######################


> Neighbours evaluated; 85
> Selected Move:	2802	4	12	17	25100


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  0  1  0  0  1  0  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,175

## ITERATION 71 #######################


> Neighbours evaluated; 86
> Selected Move:	2820	3	17	1	23600


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  1  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,17

## ITERATION 72 #######################


> Neighbours evaluated; 94
> Selected Move:	2820	4	3	12	24200


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  4  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,165

## ITERATION 73 #######################


> Neighbours evaluated; 94
> Selected Move:	2820	4	12	16	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  1  0  1  0  4  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 74 #######################


> Neighbours evaluated; 94
> Selected Move:	2820	3	14	13	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  1  1  0  0  4  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 75 #######################


> Neighbours evaluated; 93
> Selected Move:	2820	4	16	3	24100


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 76 #######################


> Neighbours evaluated; 94
> Selected Move:	2820	4	3	12	24700


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  4  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 77 #######################


> Neighbours evaluated; 99
> Selected Move:	2740	3	16	11	23700


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  1  4  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 78 #######################


> Neighbours evaluated; 101
> Selected Move:	2740	4	12	3	23100


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  1  0  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 79 #######################


> Neighbours evaluated; 99
> Selected Move:	2740	4	3	11	24900


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  4  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 80 #######################


> Neighbours evaluated; 96
> Selected Move:	2740	4	11	13	24700


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  1  1  4  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 81 #######################


> Neighbours evaluated; 104
> Selected Move:	2733	3	11	16	25700


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  1  4  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 82 #######################


> Neighbours evaluated; 99
> Selected Move:	2720	3	16	7	23200


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1  0  0  1  4  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 83 #######################


> Neighbours evaluated; 102
> Selected Move:	2720	4	13	3	21600


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  1  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 84 #######################


> Neighbours evaluated; 102
> Selected Move:	2884	1	-1	15	25600


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  1  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 85 #######################


> Neighbours evaluated; 117
> Selected Move:	2940	3	13	14	25100


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  1  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 86 #######################


> Neighbours evaluated; 120
> Selected Move:	2930	3	15	19	25600


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 87 #######################


> Neighbours evaluated; 119
> Selected Move:	2903	3	14	18	25600


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  1  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,0999999999999996

## ITERATION 88 #######################


> Neighbours evaluated; 119
> Selected Move:	2880	3	18	13	26100


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  1  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 89 #######################


> Neighbours evaluated; 116
> Selected Move:	2900	3	12	5	24600


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  1  0  0  0  1  0  0  0  0  0  1    >new incumb.: 2900


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 90 #######################


> Neighbours evaluated; 109
> Selected Move:	2900	3	13	14	24100


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,115

## ITERATION 91 #######################


> Neighbours evaluated; 108
> Selected Move:	2911	3	9	8	25600


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,12

## ITERATION 92 #######################


> Neighbours evaluated; 104
> Selected Move:	2880	3	3	2	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 93 #######################


> Neighbours evaluated; 128
> Selected Move:	2975	3	7	6	26000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,13

## ITERATION 94 #######################


> Neighbours evaluated; 126
> Selected Move:	2970	3	5	4	26000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,135

## ITERATION 95 #######################


> Neighbours evaluated; 126
> Selected Move:	2925	3	19	9	26000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 96 #######################


> Neighbours evaluated; 126
> Selected Move:	2920	3	4	5	26000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 97 #######################


> Neighbours evaluated; 126
> Selected Move:	2958	3	14	15	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 98 #######################


> Neighbours evaluated; 127
> Selected Move:	3130	3	9	7	25000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0  0  0  0  0  0  1  0  0  0  0    >new incumb.: 3130


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 99 #######################


> Neighbours evaluated; 126
> Selected Move:	3090	3	5	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 100 #######################


> Neighbours evaluated; 126
> Selected Move:	2910	3	7	9	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 101 #######################


> Neighbours evaluated; 125
> Selected Move:	2990	3	6	10	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 102 #######################


> Neighbours evaluated; 123
> Selected Move:	3030	3	4	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 103 #######################


> Neighbours evaluated; 123
> Selected Move:	3030	3	10	17	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 104 #######################


> Neighbours evaluated; 123
> Selected Move:	3030	3	17	18	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 105 #######################


> Neighbours evaluated; 126
> Selected Move:	2990	3	5	4	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,17

## ITERATION 106 #######################


> Neighbours evaluated; 125
> Selected Move:	2990	3	9	11	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 107 #######################


> Neighbours evaluated; 125
> Selected Move:	2990	3	4	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 108 #######################


> Neighbours evaluated; 126
> Selected Move:	2940	3	11	19	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 109 #######################


> Neighbours evaluated; 127
> Selected Move:	2970	3	15	7	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,15

## ITERATION 110 #######################


> Neighbours evaluated; 127
> Selected Move:	2970	3	18	10	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 111 #######################


> Neighbours evaluated; 127
> Selected Move:	2970	3	10	17	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,14

## ITERATION 112 #######################


> Neighbours evaluated; 126
> Selected Move:	2940	3	7	15	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 113 #######################


> Neighbours evaluated; 126
> Selected Move:	2963	3	17	6	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 114 #######################


> Neighbours evaluated; 123
> Selected Move:	2940	3	6	10	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 115 #######################


> Neighbours evaluated; 124
> Selected Move:	2940	3	5	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 116 #######################


> Neighbours evaluated; 127
> Selected Move:	2940	3	10	17	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 117 #######################


> Neighbours evaluated; 127
> Selected Move:	2990	3	19	9	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,11

## ITERATION 118 #######################


> Neighbours evaluated; 124
> Selected Move:	2880	3	9	11	26000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 119 #######################


> Neighbours evaluated; 125
> Selected Move:	2933	3	17	6	26500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 120 #######################


> Neighbours evaluated; 123
> Selected Move:	2980	3	4	5	26500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 121 #######################


> Neighbours evaluated; 122
> Selected Move:	2910	3	15	14	27000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0  0  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 122 #######################


> Neighbours evaluated; 124
> Selected Move:	2930	3	11	7	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 123 #######################


> Neighbours evaluated; 123
> Selected Move:	2928	3	5	4	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 124 #######################


> Neighbours evaluated; 124
> Selected Move:	2900	3	6	15	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 125 #######################


> Neighbours evaluated; 127
> Selected Move:	2900	3	1	17	25000


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  1  0  0  0  0  0  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,12

## ITERATION 126 #######################


> Neighbours evaluated; 114
> Selected Move:	2910	3	14	6	26500


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  1  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,125

## ITERATION 127 #######################


> Neighbours evaluated; 115
> Selected Move:	2943	3	4	5	26500


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  1  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,13

## ITERATION 128 #######################


> Neighbours evaluated; 112
> Selected Move:	2961	4	17	8	26300


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  3  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,135

## ITERATION 129 #######################


> Neighbours evaluated; 114
> Selected Move:	3000	3	17	18	25300


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  3  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 130 #######################


> Neighbours evaluated; 116
> Selected Move:	2998	3	5	4	25300


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  3  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 131 #######################


> Neighbours evaluated; 116
> Selected Move:	2968	4	8	6	25500


> New Y[]: 
	
	 2  0  4  0  1  0  3  1  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 132 #######################


> Neighbours evaluated; 114
> Selected Move:	2965	3	4	5	25500


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 133 #######################


> Neighbours evaluated; 117
> Selected Move:	2900	3	8	9	24000


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,16

## ITERATION 134 #######################


> Neighbours evaluated; 119
> Selected Move:	2950	3	2	8	25500


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  4  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,165

## ITERATION 135 #######################


> Neighbours evaluated; 99
> Selected Move:	2908	3	5	4	25500


> New Y[]: 
	
	 2  0  0  0  1  0  3  1  4  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,17

## ITERATION 136 #######################


> Neighbours evaluated; 97
> Selected Move:	2870	3	6	1	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  4  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 137 #######################


> Neighbours evaluated; 114
> Selected Move:	2990	3	7	11	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  1  0  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 138 #######################


> Neighbours evaluated; 103
> Selected Move:	2990	3	4	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  1  0  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 139 #######################


> Neighbours evaluated; 109
> Selected Move:	2920	3	8	2	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 140 #######################


> Neighbours evaluated; 126
> Selected Move:	2980	3	15	13	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 141 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	9	19	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 142 #######################


> Neighbours evaluated; 128
> Selected Move:	2980	3	11	9	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 143 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	13	14	23000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 144 #######################


> Neighbours evaluated; 128
> Selected Move:	3040	3	19	16	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 145 #######################


> Neighbours evaluated; 128
> Selected Move:	2980	3	16	11	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 146 #######################


> Neighbours evaluated; 125
> Selected Move:	2980	3	9	19	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,155

## ITERATION 147 #######################


> Neighbours evaluated; 126
> Selected Move:	2980	3	18	10	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,15

## ITERATION 148 #######################


> Neighbours evaluated; 123
> Selected Move:	2980	3	10	17	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,145

## ITERATION 149 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	11	9	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 150 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	14	13	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 151 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	17	10	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 152 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	13	14	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 153 #######################


> Neighbours evaluated; 125
> Selected Move:	2980	3	19	11	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  1  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 154 #######################


> Neighbours evaluated; 126
> Selected Move:	2980	3	10	17	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 155 #######################


> Neighbours evaluated; 125
> Selected Move:	2950	3	14	15	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,11

## ITERATION 156 #######################


> Neighbours evaluated; 126
> Selected Move:	2925	3	15	13	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 157 #######################


> Neighbours evaluated; 125
> Selected Move:	2928	3	9	19	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 158 #######################


> Neighbours evaluated; 125
> Selected Move:	2930	3	17	10	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 159 #######################


> Neighbours evaluated; 123
> Selected Move:	2933	3	19	9	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 160 #######################


> Neighbours evaluated; 124
> Selected Move:	2920	3	13	15	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 161 #######################


> Neighbours evaluated; 124
> Selected Move:	2905	3	2	8	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  1  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 162 #######################


> Neighbours evaluated; 113
> Selected Move:	2900	3	5	4	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  1  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 163 #######################


> Neighbours evaluated; 110
> Selected Move:	2895	3	10	17	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 164 #######################


> Neighbours evaluated; 113
> Selected Move:	2890	3	4	5	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 165 #######################


> Neighbours evaluated; 116
> Selected Move:	2873	3	17	6	26500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  4  1  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 166 #######################


> Neighbours evaluated; 102
> Selected Move:	3030	3	11	7	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 167 #######################


> Neighbours evaluated; 105
> Selected Move:	2990	3	5	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 168 #######################


> Neighbours evaluated; 104
> Selected Move:	2920	3	15	14	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 169 #######################


> Neighbours evaluated; 106
> Selected Move:	2918	3	4	5	25500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 170 #######################


> Neighbours evaluated; 104
> Selected Move:	2915	3	9	19	25500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,135

## ITERATION 171 #######################


> Neighbours evaluated; 105
> Selected Move:	2920	3	14	15	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 172 #######################


> Neighbours evaluated; 109
> Selected Move:	2870	3	5	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 173 #######################


> Neighbours evaluated; 105
> Selected Move:	2908	3	15	14	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,15

## ITERATION 174 #######################


> Neighbours evaluated; 104
> Selected Move:	2830	3	14	13	26000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,155

## ITERATION 175 #######################


> Neighbours evaluated; 101
> Selected Move:	2825	3	4	5	26000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 176 #######################


> Neighbours evaluated; 104
> Selected Move:	2820	3	19	9	26000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 177 #######################


> Neighbours evaluated; 101
> Selected Move:	2880	3	8	2	24500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 178 #######################


> Neighbours evaluated; 128
> Selected Move:	2900	3	13	15	23500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 179 #######################


> Neighbours evaluated; 124
> Selected Move:	2900	3	0	17	25000


> New Y[]: 
	
	 0  3  4  0  0  1  1  1  0  1  0  0  0  0  0  1  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,18

## ITERATION 180 #######################


> Neighbours evaluated; 118
> Selected Move:	2840	3	5	4	25000


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  0  1  0  0  0  0  0  1  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 181 #######################


> Neighbours evaluated; 115
> Selected Move:	2840	3	17	0	23500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 182 #######################


> Neighbours evaluated; 123
> Selected Move:	2880	3	15	13	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 183 #######################


> Neighbours evaluated; 126
> Selected Move:	2880	3	13	14	24000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 184 #######################


> Neighbours evaluated; 123
> Selected Move:	2880	3	4	5	24000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 185 #######################


> Neighbours evaluated; 123
> Selected Move:	2878	3	7	12	26500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 186 #######################


> Neighbours evaluated; 125
> Selected Move:	2970	3	6	15	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 187 #######################


> Neighbours evaluated; 128
> Selected Move:	3020	3	12	3	24500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 188 #######################


> Neighbours evaluated; 127
> Selected Move:	3020	3	14	13	25000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 189 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	5	4	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 190 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	13	14	24500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 191 #######################


> Neighbours evaluated; 126
> Selected Move:	2900	3	3	12	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 192 #######################


> Neighbours evaluated; 127
> Selected Move:	2900	3	14	13	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 193 #######################


> Neighbours evaluated; 127
> Selected Move:	2970	3	4	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 194 #######################


> Neighbours evaluated; 126
> Selected Move:	2890	3	15	6	27000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 195 #######################


> Neighbours evaluated; 124
> Selected Move:	2903	3	12	8	26500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 196 #######################


> Neighbours evaluated; 124
> Selected Move:	2950	3	9	19	26500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,0949999999999996

## ITERATION 197 #######################


> Neighbours evaluated; 124
> Selected Move:	2958	3	5	4	26500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,0899999999999996

## ITERATION 198 #######################


> Neighbours evaluated; 125
> Selected Move:	2945	3	13	15	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 199 #######################


> Neighbours evaluated; 120
> Selected Move:	2940	3	6	18	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 200 #######################


> Neighbours evaluated; 123
> Selected Move:	2930	3	15	7	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,105

## ITERATION 201 #######################


> Neighbours evaluated; 127
> Selected Move:	2973	1	-1	14	28500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 202 #######################


> Neighbours evaluated; 134
> Selected Move:	3040	3	8	9	27000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,115

## ITERATION 203 #######################


> Neighbours evaluated; 132
> Selected Move:	3110	3	4	5	27000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 204 #######################


> Neighbours evaluated; 133
> Selected Move:	3040	3	14	13	27500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 205 #######################


> Neighbours evaluated; 132
> Selected Move:	2948	3	5	4	27500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,13

## ITERATION 206 #######################


> Neighbours evaluated; 133
> Selected Move:	2930	2	7	-1	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,135

## ITERATION 207 #######################


> Neighbours evaluated; 127
> Selected Move:	2950	3	4	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,14

## ITERATION 208 #######################


> Neighbours evaluated; 127
> Selected Move:	2950	3	13	14	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,145

## ITERATION 209 #######################


> Neighbours evaluated; 127
> Selected Move:	2930	3	3	4	23000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,15

## ITERATION 210 #######################


> Neighbours evaluated; 125
> Selected Move:	2930	3	2	16	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  0  0  1  0  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,155

## ITERATION 211 #######################


> Neighbours evaluated; 111
> Selected Move:	2980	3	4	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  0  1  0  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,15

## ITERATION 212 #######################


> Neighbours evaluated; 119
> Selected Move:	2920	3	16	11	25400


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  4  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 213 #######################


> Neighbours evaluated; 119
> Selected Move:	2900	3	11	8	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,14

## ITERATION 214 #######################


> Neighbours evaluated; 116
> Selected Move:	2900	3	5	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,135

## ITERATION 215 #######################


> Neighbours evaluated; 116
> Selected Move:	2900	3	14	13	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  1  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,13

## ITERATION 216 #######################


> Neighbours evaluated; 115
> Selected Move:	2900	3	4	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  1  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,125

## ITERATION 217 #######################


> Neighbours evaluated; 116
> Selected Move:	2918	3	8	16	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  1  0  0  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,12

## ITERATION 218 #######################


> Neighbours evaluated; 116
> Selected Move:	2872	3	16	11	25900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  4  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 219 #######################


> Neighbours evaluated; 117
> Selected Move:	2900	4	11	13	25700


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  1  0  4  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 220 #######################


> Neighbours evaluated; 120
> Selected Move:	2853	3	5	4	25700


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  0  4  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 
 > pw :0,115

## ITERATION 221 #######################


> Neighbours evaluated; 120
> Selected Move:	2873	4	13	4	25500


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  1  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 
 > pw :0,12

## ITERATION 222 #######################


> Neighbours evaluated; 120
> Selected Move:	2930	3	13	14	25000


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 
 > pw :0,125

## ITERATION 223 #######################


> Neighbours evaluated; 120
> Selected Move:	2938	3	4	3	25100


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  1  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 
 > pw :0,13

## ITERATION 224 #######################


> Neighbours evaluated; 120
> Selected Move:	2876	3	3	5	25800


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  1  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 225 #######################


> Neighbours evaluated; 118
> Selected Move:	2859	4	5	18	25900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 226 #######################


> Neighbours evaluated; 119
> Selected Move:	2896	3	18	10	25600


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  4  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 227 #######################


> Neighbours evaluated; 110
> Selected Move:	2843	3	5	4	25600


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  4  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 
 > pw :0,15

## ITERATION 228 #######################


> Neighbours evaluated; 112
> Selected Move:	2795	3	10	18	25900


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 
 > pw :0,155

## ITERATION 229 #######################


> Neighbours evaluated; 117
> Selected Move:	2868	4	18	11	25400


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  4  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 230 #######################


> Neighbours evaluated; 115
> Selected Move:	2786	4	11	19	25900


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 
 > pw :0,165

## ITERATION 231 #######################


> Neighbours evaluated; 115
> Selected Move:	2930	3	19	2	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 232 #######################


> Neighbours evaluated; 126
> Selected Move:	2930	3	9	19	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,175

## ITERATION 233 #######################


> Neighbours evaluated; 126
> Selected Move:	2930	3	11	16	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,18

## ITERATION 234 #######################


> Neighbours evaluated; 126
> Selected Move:	2960	3	4	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 235 #######################


> Neighbours evaluated; 125
> Selected Move:	2900	3	16	8	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,19

## ITERATION 236 #######################


> Neighbours evaluated; 121
> Selected Move:	2900	3	5	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,185

## ITERATION 237 #######################


> Neighbours evaluated; 120
> Selected Move:	2900	3	14	13	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,18

## ITERATION 238 #######################


> Neighbours evaluated; 120
> Selected Move:	2930	3	8	11	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,175

## ITERATION 239 #######################


> Neighbours evaluated; 125
> Selected Move:	2930	3	19	9	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 240 #######################


> Neighbours evaluated; 125
> Selected Move:	2900	3	11	8	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 241 #######################


> Neighbours evaluated; 122
> Selected Move:	2900	3	4	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 242 #######################


> Neighbours evaluated; 122
> Selected Move:	2960	3	8	16	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,155

## ITERATION 243 #######################


> Neighbours evaluated; 125
> Selected Move:	2900	3	13	15	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 244 #######################


> Neighbours evaluated; 125
> Selected Move:	2870	3	16	7	22000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 245 #######################


> Neighbours evaluated; 124
> Selected Move:	2900	3	0	6	24400


> New Y[]: 
	
	 0  3  4  0  0  1  2  1  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,14

## ITERATION 246 #######################


> Neighbours evaluated; 119
> Selected Move:	2900	4	6	5	24700


> New Y[]: 
	
	 0  3  4  0  0  2  1  1  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,135

## ITERATION 247 #######################


> Neighbours evaluated; 119
> Selected Move:	2853	3	15	14	25200


> New Y[]: 
	
	 0  3  4  0  0  2  1  1  0  1  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,13

## ITERATION 248 #######################


> Neighbours evaluated; 118
> Selected Move:	2880	4	5	6	24900


> New Y[]: 
	
	 0  3  4  0  0  1  2  1  0  1  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,125

## ITERATION 249 #######################


> Neighbours evaluated; 118
> Selected Move:	2880	3	5	4	24900


> New Y[]: 
	
	 0  3  4  0  1  0  2  1  0  1  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,12

## ITERATION 250 #######################


> Neighbours evaluated; 119
> Selected Move:	2840	3	14	15	24400


> New Y[]: 
	
	 0  3  4  0  1  0  2  1  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,115

## ITERATION 251 #######################


> Neighbours evaluated; 118
> Selected Move:	2867	3	2	8	25900


> New Y[]: 
	
	 0  3  0  0  1  0  2  1  4  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 252 #######################


> Neighbours evaluated; 111
> Selected Move:	2871	3	4	5	25900


> New Y[]: 
	
	 0  3  0  0  0  1  2  1  4  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 253 #######################


> Neighbours evaluated; 112
> Selected Move:	2870	3	6	0	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 254 #######################


> Neighbours evaluated; 115
> Selected Move:	2870	3	5	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  4  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 255 #######################


> Neighbours evaluated; 119
> Selected Move:	2888	3	18	6	26500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  4  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 256 #######################


> Neighbours evaluated; 105
> Selected Move:	2931	4	8	3	26100


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 257 #######################


> Neighbours evaluated; 112
> Selected Move:	2928	3	8	12	26600


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 258 #######################


> Neighbours evaluated; 106
> Selected Move:	2860	4	3	12	27200


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  1  0  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 259 #######################


> Neighbours evaluated; 102
> Selected Move:	2877	3	6	14	25700


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1  0  0  4  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 260 #######################


> Neighbours evaluated; 119
> Selected Move:	2858	3	15	19	26200


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1  0  0  4  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 261 #######################


> Neighbours evaluated; 118
> Selected Move:	2822	3	14	18	26200


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1  0  0  4  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,12

## ITERATION 262 #######################


> Neighbours evaluated; 118
> Selected Move:	2810	3	3	5	24700


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  0  0  4  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,125

## ITERATION 263 #######################


> Neighbours evaluated; 120
> Selected Move:	2870	3	12	8	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,13

## ITERATION 264 #######################


> Neighbours evaluated; 117
> Selected Move:	2885	1	-1	14	28500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 265 #######################


> Neighbours evaluated; 118
> Selected Move:	2848	3	5	4	28500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  4  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,14

## ITERATION 266 #######################


> Neighbours evaluated; 116
> Selected Move:	2830	2	14	-1	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  4  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,145

## ITERATION 267 #######################


> Neighbours evaluated; 116
> Selected Move:	2830	4	8	4	25000


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  1  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,15

## ITERATION 268 #######################


> Neighbours evaluated; 117
> Selected Move:	2870	3	19	15	24500


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  1  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 269 #######################


> Neighbours evaluated; 117
> Selected Move:	2870	3	4	3	24600


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  1  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 270 #######################


> Neighbours evaluated; 118
> Selected Move:	2855	3	8	12	25100


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  0  1  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 271 #######################


> Neighbours evaluated; 116
> Selected Move:	2820	3	3	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  4  1  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,14

## ITERATION 272 #######################


> Neighbours evaluated; 114
> Selected Move:	2792	4	8	12	25200


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  4  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,135

## ITERATION 273 #######################


> Neighbours evaluated; 115
> Selected Move:	2850	3	8	5	24200


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  0  0  4  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 274 #######################


> Neighbours evaluated; 117
> Selected Move:	2824	3	18	10	25200


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  1  0  4  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 275 #######################


> Neighbours evaluated; 120
> Selected Move:	2870	3	12	2	23000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 276 #######################


> Neighbours evaluated; 124
> Selected Move:	2900	3	1	6	25000


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 277 #######################


> Neighbours evaluated; 118
> Selected Move:	2900	3	10	17	25000


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  0  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,11

## ITERATION 278 #######################


> Neighbours evaluated; 117
> Selected Move:	2965	3	9	8	26500


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,105

## ITERATION 279 #######################


> Neighbours evaluated; 114
> Selected Move:	2933	3	5	4	26500


> New Y[]: 
	
	 2  0  4  0  1  0  3  1  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,11

## ITERATION 280 #######################


> Neighbours evaluated; 114
> Selected Move:	2947	4	6	8	26300


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  3  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,115

## ITERATION 281 #######################


> Neighbours evaluated; 113
> Selected Move:	2900	3	6	14	24800


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  3  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,12

## ITERATION 282 #######################


> Neighbours evaluated; 114
> Selected Move:	2900	3	4	5	24800


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  3  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,115

## ITERATION 283 #######################


> Neighbours evaluated; 114
> Selected Move:	2900	4	8	17	25000


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  1  0  0  0  0  0  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,11

## ITERATION 284 #######################


> Neighbours evaluated; 113
> Selected Move:	2900	3	17	1	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 285 #######################


> Neighbours evaluated; 124
> Selected Move:	2900	3	5	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 286 #######################


> Neighbours evaluated; 127
> Selected Move:	2980	3	14	6	26500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 287 #######################


> Neighbours evaluated; 124
> Selected Move:	2890	3	8	12	27000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 288 #######################


> Neighbours evaluated; 126
> Selected Move:	2920	3	7	9	27500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 289 #######################


> Neighbours evaluated; 126
> Selected Move:	2955	3	12	5	26000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 290 #######################


> Neighbours evaluated; 120
> Selected Move:	2910	3	5	4	26000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 291 #######################


> Neighbours evaluated; 119
> Selected Move:	2850	3	3	5	24500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 292 #######################


> Neighbours evaluated; 119
> Selected Move:	2900	3	4	11	25000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 293 #######################


> Neighbours evaluated; 119
> Selected Move:	2845	3	11	12	26000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 294 #######################


> Neighbours evaluated; 118
> Selected Move:	2850	3	6	18	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,135

## ITERATION 295 #######################


> Neighbours evaluated; 122
> Selected Move:	2865	3	5	3	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 296 #######################


> Neighbours evaluated; 127
> Selected Move:	2960	3	12	8	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,145

## ITERATION 297 #######################


> Neighbours evaluated; 126
> Selected Move:	2870	3	9	7	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 298 #######################


> Neighbours evaluated; 126
> Selected Move:	2895	3	15	19	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,155
________________________________________________________________

Best solution found: 3130
Run Termination time: 31.01.2010 11:11:52
Run duration: 00:06:32.6562500
________________________________________________________________
